Restricting Voronoi diagrams to meshes using corner validation
نویسندگان
چکیده
منابع مشابه
Restricting Voronoi diagrams to meshes using corner validation
Restricted Voronoi diagrams are a fundamental geometric structure used in many applications such as surface reconstruction from point sets or optimal transport. Given a set of sites V = {vk}k=1 ⊂ R d and a mesh X with vertices in Rd connected by triangles, the restricted Voronoi diagram partitions X by computing for each site the portion of X for which the site is the nearest. The restricted Vo...
متن کاملPolyline-sourced Geodesic Voronoi Diagrams on Triangle Meshes
This paper studies the Voronoi diagrams on 2-manifold meshes based on geodesic metric (a.k.a. geodesic Voronoi diagrams or GVDs), which have polyline generators. We show that our general setting leads to situations more complicated than conventional 2D Euclidean Voronoi diagrams as well as point-source based GVDs, since a typical bisector contains line segments, hyperbolic segments and paraboli...
متن کاملImage Processing using Voronoi diagrams
1 This work has been partially supported by grant TIN2005-08863-C03 of the Spanish Ministry of Science and Education 2 Corresponding address: [email protected] Abstract – In this paper we present some techniques for obtaining non-photorealistc images with the aid of Voronoi diagrams, such as stained-glass images. We also show examples of their potential applications, including lossy image ...
متن کاملImage Stained Glass using Voronoi Diagrams
The geometrical concept of the Voronoi diagram was used to create an image filter providing a “stained glass” or mosaic effect on an image. The Voronoi diagram was calculated by exploiting its dual relationship with the Delaunay triangulation, which was in turn calculated using a randomized incremental algorithm and stored in a DCEL. Various methods were tried for selecting the points, includin...
متن کاملCalculating Voronoi Diagrams using Convex Sweep Curves
The Voronoi diagram is an important data structure in computational geometry. Given n sites in the plane, the Voronoi diagram partitions the plane into n regions. The region of a site p consists of all those points that lie closer to p than to any of the other sites. For a survey on Voronoi diagrams and their applications we refer to Aurenhammer [1]. A generalization of the sweep line method of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Graphics Forum
سال: 2017
ISSN: 0167-7055
DOI: 10.1111/cgf.13247